Implementing Dynamic Programs in Spreadsheets
نویسندگان
چکیده
منابع مشابه
Implementing logic spreadsheets in LESS
Spreadsheets are a widespread tool for a variety of tasks, particularly in business settings. Spreadsheet users employ a form of programming that, while popular, is highly errorprone and has limited expressiveness. An important approach to augment spreadsheets is to provide logic knowledge representation and reasoning (KR&R) functionality. In this paper we present Logic Embedded in SpreadSheets...
متن کاملRAGSDALE A New Approach to Implementing Project Networks in Spreadsheets A New Approach to Implementing Project Networks in Spreadsheets
ISeveral approaches have been proposed for implementing project networks in spreadsheets. The approaches suggested to date are overly tedious to implement for problems of realistic size and/or require error-prone manual intervention if precedence relations among activities change or project activities are added or deleted. This paper introduces a new and more efficient approach to implementing ...
متن کاملImplementing dynamic flowgraph methodology models with logic programs
The dynamic flowgraph methodology (DFM) is a promising way to find the prime implicants of a top event for a dynamic system possibly containing digital subsystems. This paper demonstrates how to express dynamic flowgraph methodology models as logic programs, and top events as queries to those programs, in a natural and comprehensible way. Computation of the logic program lists the prime implica...
متن کاملDyna: A Declarative Language for Implementing Dynamic Programs
We present the first version of a new declarative programming language. Dyna has many uses but was designed especially for rapid development of new statistical NLP systems. A Dyna program is a small set of equations, resembling Prolog inference rules, that specify the abstract structure of a dynamic programming algorithm. It compiles into efficient, portable, C++ classes that can be easily invo...
متن کاملImplementing Efficient Dynamic Formal Verification Methods for MPI Programs
We examine the problem of formally verifying MPI programs for safety properties through an efficient dynamic (runtime) method in which the processes of a given MPI program are executed under the control of an interleaving scheduler. To ensure full coverage for given input test data, the algorithm must take into consideration MPI’s out-of-order completion semantics. The algorithm must also ensur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Transactions on Education
سال: 2005
ISSN: 1532-0545,1532-0545
DOI: 10.1287/ited.5.2.25